The maximum likelihood degree of Fermat hypersurfaces
نویسندگان
چکیده
منابع مشابه
The Maximum Likelihood Degree
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of bounded regions in the corresponding arrangement of hypersurfaces, and to the Euler characteristic of the complexified complement. Under suitable hypotheses...
متن کاملVarieties with maximum likelihood degree one
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduced A-discriminantal varieties under monomial maps with finite fibers. The maximum likelihood estimator corresponding to such a variety is Kapranov’s Horn uniformization. This extends Kapranov’s characterization of A-discriminantal hypersurfaces to varieties of arbitrary codimension.
متن کاملThe maximum likelihood degree of a very affine variety
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao’s solution to Varchenko’s conjecture on complements of hyperplane arrangements to smooth very affine varieties. For very affine varieties satisfying a genericity condition at infinity, the result is further strengthened to relate th...
متن کاملThe Zeta-function of Monomial Deformations of Fermat Hypersurfaces
This paper intends to give a mathematical explanation for results on the zeta-function of some families of varieties recently obtained in the context of Mirror Symmetry [4], [9]. In doing so, we obtain concrete and explicit examples for some results recently used in algorithms to count points on smooth hypersurfaces in Pn. In particular, we extend the monomial-motive correspondence of Kadir and...
متن کاملMaximum Likelihood Graph Structure Estimation with Degree Distributions
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. This binary graph structure is obtained by reformulating the inference problem as a generalization of the polynomial time combinatorial optimization problem known as b-matching, which recovers a degree constrained maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Statistics
سال: 2015
ISSN: 1309-3452
DOI: 10.18409/jas.v6i2.44